Minimal Infeasible Sets of Connections: a Representation for Eecient Assembly Sequence Planning
نویسنده
چکیده
This paper describes methods aimed at increasing the eeciency of cutset-based assembly sequence planners by: (i) providing an alternative representation to precedence constraints which is easy to maintain and facilitates the logical evaluation of assembly operations, (ii) maximizing the reuse of previous results of assembly operation feasibility evaluations and (iii) using exact and heuristic assembly knowledge encoded in a knowledge-based system, which may provide time saving shortcuts to the direct use of geometric algorithms. It is formally proved that in this method it is suucient to evaluate directly the assembly operations corresponding to the decompositions of a product in its completely assembled state for the generation of all assembly sequences of a product. The feasibility of any other operation, that may be performed in the assembly of the product, can then be logically inferred from these evaluation results. A simple and well known assembly is used to illustrate the application of the approach and facilitate a comparison with other methods.
منابع مشابه
Identifying and Explaining Infeasible Assembly Operations
This paper presents a knowledge-based method for identifying infeasible assembly operations in the context of assembly sequence planning. In addition the reasons for the infeasibility are identified and these can guide product designers towards the necessary design changes to make a preferred assembly sequence feasible, or guarantee that an assembly sequence includes a specific partial assembly...
متن کاملA novel means of generating assembly sequences using the connector concept
Assembly planning attempts to arrange product assembly sequences on the basis of the input of product description, similar assembly plans and assembly constraints. Assembly planning is frequently viewed as a creative thinking process, which requires extensive assembly planning experience. Assembly product modeling with mechanical connection functions has increasingly focused on assembly sequenc...
متن کاملOn Assembly Sequence Planning using Petri Nets
Petri nets have been proposed as a suitable tool for expressing precedence constraints and computing assembly sequences. Motivations for using Petri nets stem from their clear and well-deened semantics as well as from the formal analysis tools and techniques available. In this paper the operation and properties of Petri net models representing assembly plans are reconnected to the fundamental p...
متن کاملUsing memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors such as geometric features, assembly time, tools, and machines are considered to arrange a feasible assembly sequence based on planner’s individual heuristics. Suchlike planning may implement genetic algorithms to go tow...
متن کامل